A greedy algorithm for yield surface approximation

A greedy algorithm for yield surface approximation

This Note presents an approximation method for convex yield surfaces in the framework of yield design theory. The proposed algorithm constructs an approximation using a convex hull of ellipsoids such that the approximate criterion can be formulated in terms of second-order conic constraints. The algorithm can treat bounded as well as unbounded yield surfaces. Its efficiency is illustrated on tw...

A novel greedy algorithm for Nyström approximation

The Nyström method is an efficient technique for obtaining a low-rank approximation of a large kernel matrix based on a subset of its columns. The quality of the Nyström approximation highly depends on the subset of columns used, which are usually selected using random sampling. This paper presents a novel recursive algorithm for calculating the Nyström approximation, and an effective greedy cr...

A General Greedy Approximation Algorithm with Applications

Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class of convex optimization problems. We derive a bound on the rate of approximation for this algorithm, and show that our algorithm includes a number of earlier studies as special cases.

A greedy approximation algorithm for the group Steiner problem

Greedy algorithm for stochastic matching is a 2-approximation

The stochastic matching problem was first introduced by Chen, Immorlica, Karlin, Mahdian, and Rudra (ICALP 2009 ). They presented greedy algorithm together with an analysis showing that this is a 4-approximation. They also presented modification of this problem called multiple-rounds matching, and gave O(log n)-approximation algorithm. Many questions were remaining after this work: is the greed...